Variable and Value Ordering When Solving Balanced Academic Curriculum Problems
نویسندگان
چکیده
In this paper we present the use of Constraint Programming for solving balanced academic curriculum problems. We discuss the important role that heuristics play when solving a problem using a constraint-based approach. We also show how constraint solving techniques allow to very efficiently solve combinatorial optimization problems that are too hard for integer programming techniques.
منابع مشابه
Look-Ahead Value Ordering for Constraint Satisfaction Problems
Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another bene t of looking ahead is a useful domain value ordering heuristic, which we call look-a...
متن کاملA new approach to fuzzy quantities ordering based on distance method and its applications for solving fuzzy linear programming
Many ranking methods have been proposed so far. However, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. For overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...
متن کاملSucceed--rst or Fail--rst: a Case Study in Variable and Value Ordering 1 a Revised Version of a Paper Presented at the Ilog Solver and Ilog Schedule 2nd International Users'
It is well known that appropriate variable and value ordering heuristics are often crucial when solving constraint satisfaction problems. A variable ordering heuristic which is often recommended, and is often successful, is based on the `failrst' principle: choose next the variable with the smallest remaining domain. General-purpose value ordering heuristics are less common, but it has been arg...
متن کاملOptimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملVariable and Value Ordering Decision Matrix Hyper-heuristics: A Local Improvement Approach
Constraint Satisfaction Problems (CSP) represent an important topic of study because of their many applications in different areas of artificial intelligence and operational research. When solving a CSP, the order in which the variables are selected to be instantiated and the order of the values to be tried affect the complexity of the search. Hyper-heuristics are flexible methods that provide ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.PL/0110007 شماره
صفحات -
تاریخ انتشار 2001